Optimum Secret Sharing Scheme Secure against Cheating

نویسندگان

  • Wakaha Ogata
  • Kaoru Kurosawa
چکیده

Tompa and Woll considered a problem of cheaters in (k; n) threshold secret sharing schemes. We rst derive a tight lower bound on the size of shares jV i j for this problem: jV i j (jSj 1)= + 1, where V i denotes the set of shares of participant P i , S denotes the set of secrets, and denotes the cheating probability. We next present an optimum scheme which meets the equality of our bound by using \di erence sets."

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution

We consider the problem of cheating in secret sharing schemes, cheating in which individuals submit forged shares in the secret reconstruction phase in an effort to make another participant reconstruct an invalid secret. We introduce a novel technique which uses universal hash functions to detect such cheating and propose two efficient secret sharing schemes that employ the functions. The first...

متن کامل

Computationally secure multiple secret sharing: models, schemes, and formal security analysis

A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...

متن کامل

Security Analysis of a Hash-Based Secret Sharing Scheme

Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...

متن کامل

Ogata : on the Practical Secret Sharing Scheme

In this paper, we attempt to construct practical secret sharing schemes, which scheme has smaller share size and can detect cheating with high probability. We de ne two secure ramp schemes, secure ramp scheme and strongly secure ramp scheme. Then, we propose two constructions of secure ramp scheme. These schemes both have small share size and the cheating can be detected with high probability. ...

متن کامل

On the Security of a Cheating Immune Visual Secret Sharing Scheme

Visual Secret Sharing (VSS), first invented by Naor and Shamir, is a variant of secret sharing. In the literature, VSS schemes have many applications, including visual authentication and identification, steganography, and image encryption. Moreover, VSS schemes provide the secure services in communications. In 2010, De Prisco and De Santis deeply discussed the problem of cheating in VSS, gave t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Discrete Math.

دوره 20  شماره 

صفحات  -

تاریخ انتشار 1996